Capacitated Vehicle Routing Problem Solving through Adaptive Sweep Based Clustering plus Swarm Intelligence based Route Optimization
نویسندگان
چکیده
منابع مشابه
Particle Swarm Optimization In Solving Capacitated Vehicle Routing Problem
The Capacitated Vehicle Routing Problem (CVRP) is a NP – Complete problem and according to this definition there is no exact solution for it. So researchers try to achieve a near optimum solution for it, by using meta – heuristic algorithms. The aim of CVRP is to find optimum route for every vehicle as a sequence of customers, that vehicle served. We employ Particle Swarm Optimization to solve ...
متن کاملCapacitated Vehicle Routing Problem Solving using Adaptive Sweep and Velocity Tentative PSO
Vehicle Routing Problem (VRP) has become an integral part in logistic operations which determines optimal routes for several vehicles to serve customers. The basic version of VRP is Capacitated VRP (CVRP) which considers equal capacities for all vehicles. The objective of CVRP is to minimize the total traveling distance of all vehicles to serve all the customers. Various methods are used to sol...
متن کاملAutonomous Units for Solving the Capacitated Vehicle Routing Problem Based on Ant Colony Optimization
Communities of autonomous units and ant colony systems have fundamental features in common. Both consists of a set of autonomously acting units that transform and move around a common environment that is usually a graph. In contrast to ant colony systems, the actions of autonomous units are specified by graph transformation rules which have a precisely defined operational semantics and can be v...
متن کاملAn artificial fish swarm algorithm for solving a bi-objective capacitated vehicle routing problem
The paper focuses on a capacitated vehicle routing problem with two objectives: one is attainment of specific load factor and the other is minimization of total travel cost. Our approach is based on artificial fish swarm algorithm, a swarm-based heuristic, which mimics the foraging behaviour of a fish swarm. After initializing a school of artificial fish, whose validity is guaranteed by a desig...
متن کاملPeriodic Sweep Coverage Scheme Based on Periodic Vehicle Routing Problem
We provide a sweep coverage algorithm for routing mobile sensors that communicate with a central data sink. This algorithm improves on its predecessors by reducing the number of unnecessary scans when different points of interest (POIs) have different requirements for the time interval within which they must be scanned (sweep period). Most sweep coverage algorithms seek to minimize the number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Oriental journal of computer science and technology
سال: 2018
ISSN: 0974-6471,2320-8481
DOI: 10.13005/ojcst11.02.04